Cliques in realization graphs
نویسندگان
چکیده
The realization graph G(d) of a degree sequence d is the whose vertices are labeled realizations d, where edges join that differ by swapping single pair edges. Barrus (2016) [3] characterized for which triangle-free. Here, any n≥4, we describe structure in exactly determines whether has clique size n. As consequence determine sequences complete on n vertices.
منابع مشابه
Cliques in random graphs
1. Introduction. Let 0 < p < 1 be fixed and denote by G a random graph with point set N, the set of natural numbers, such that each edge occurs with probability p, independently of all other edges. In other words the random variables ei5 , 1 < i < j, defined by _ 1 if (i, j) is an edge of G, et '-0 if (i, j) is not an edge of G, are independent r .v.'s with P(e i, = 1) = p, P(eij = 0) = 1-p. De...
متن کاملDominating cliques in graphs
A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding ...
متن کاملOn cliques in diameter graphs
Note that we assume of the sphere being embedded in R, and the unit distance included from the ambient space. Diameter graphs arise naturally in the context of Borsuk’s problem. In 1933 Borsuk [3] asked whether any set of diameter 1 in R can be partitioned into (d+1) parts of strictly smaller diameter. The positive answer to this question is called Borsuk’s conjecture. This was shown to be true...
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملCliques, minors and apex graphs
In this paper, we proved the following result: Let G be a (k + 2)-connected, non-(k − 3)apex graph where k ≥ 2. If G contains three k-cliques, say L1, L2, L3, such that |Li ∩ Lj| ≤ k − 2(1 ≤ i < j ≤ 3), then G contains a Kk+2 as a minor. Note that a graph G is t-apex if G− X is planar for some subset X ⊆ V (G) of order at most t . This theorem generalizes some earlier results by Robertson, Seym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113184